Valigator: A Verification Tool with Bound and Invariant Generation
نویسندگان
چکیده
We describe Valigator, a software tool for imperative program verification that efficiently combines symbolic computation and automated reasoning in a uniform framework. The system offers support for automatically generating and proving verification conditions and, most importantly, for automatically inferring loop invariants and bound assertions by means of symbolic summation, Gröbner basis computation, and quantifier elimination. We present general principles of the implementation and illustrate them on examples.
منابع مشابه
Perturbation bounds for $g$-inverses with respect to the unitarily invariant norm
Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...
متن کاملLight-Weight Invariant Generation for Software Verification with CPAchecker
This thesis presents a light-weight approach to invariant generation in the context of an implementation of k-induction for software verification within the CPAchecker framework. CPAchecker is a tool for software verification, one of the grand challenges of computing research. Inductive methods to prove the correctness of loops have been applied for years, but rely on manual invariant annotatio...
متن کاملBeSpaceD: Towards a Tool Framework and Methodology for the Specification and Verification of Spatial Behavior of Distributed Software Component Systems
ion/invariant generation verification condition generation verification tools, e.g, SMT solvers ... sub-result evaluation parallel execution
متن کاملProgram Verification by Using DISCOVERER
Recent advances in program verification indicate that various verification problems can be reduced to semi-algebraic system (SAS for short) solving. An SAS consists of polynomial equations and polynomial inequalities. Algorithms for quantifier elimination of real closed fields are the general method for those problems. But the general method usually have low efficiency for specific problems. To...
متن کاملMechanical Generation of Invariants for FOR-Loops
In the mechanical verification of programs containing loops it is often necessary to provide loop invariants additionally to the specification in form of preand postcondition. In this paper we present a method for the mechanical generation of invariants for a class of FOR-loops. The invariant is derived from the postcondition and the final bound of the loop only. The method is applicable if the...
متن کامل